A distance for elastic matching in object recognition

نویسندگان

  • Robert Azencott
  • François Coldefy
  • Laurent Younes
چکیده

We define distances between geometric curves by the square root of the minimal energy required to transform one curve into the other. The energy is formally defined from a left invariant Riemannian distance on an infinite dimensional group acting on the curves, which can be explicitely computed. The obtained distance boils down to a variational problem for which an optimal matching between the curves has two be computed. An analysis of the distance when the curves are polygonal leads to a numerical procedure for the solution of the variational problem, which can eflciently be implemented, as illustrated by experiments. Acknowledgements : This work comes as a part of a project on object recognition, supported by the D.R.E.T. helded at SUDIMAGE research laboratory under the direction of R. Azencott. Publication is courtesy of the D.R.ET.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A NEURO-FUZZY GRAPHIC OBJECT CLASSIFIER WITH MODIFIED DISTANCE MEASURE ESTIMATOR

The paper analyses issues leading to errors in graphic object classifiers. Thedistance measures suggested in literature and used as a basis in traditional, fuzzy, andNeuro-Fuzzy classifiers are found to be not suitable for classification of non-stylized orfuzzy objects in which the features of classes are much more difficult to recognize becauseof significant uncertainties in their location and...

متن کامل

A Survey of Elastic Matching Techniques for Handwritten Character Recognition

This paper presents a survey of elastic matching (EM) techniques employed in handwritten character recognition. EM is often called deformable template, flexible matching, or nonlinear template matching, and defined as the optimization problem of two-dimensional warping (2DW) which specifies the pixel-to-pixel correspondence between two subjected character image patterns. The pattern distance ev...

متن کامل

A Face Recognition Method Based on Local Feature Analysis

Elastic Bunch Graph Matching has been proved effective for face recognition. But the recognition procedure needs large computation. Here we present an automatic face recognition method based on local feature analysis. The local features are firstly located by the face structure knowledge and gray level distribution information, rather than searching on the whole image as it does in Elastic Bunc...

متن کامل

Analysis of Cluttered Scenes Using an Elastic Matching Approach for Stereo Images

We present a system for the automatic interpretation of cluttered scenes containing multiple partly occluded objects in front of unknown, complex backgrounds. The system is based on an extended elastic graph matching algorithm that allows the explicit modeling of partial occlusions. Our approach extends an earlier system in two ways. First, we use elastic graph matching in stereo image pairs to...

متن کامل

Object Localization and Recognition for a Grasping Robot

|This paper presents a vision system (object localization and recognition) for a grasping robot environment. Our approach to object localization is based on the sequential integration of early vision processes, such as color and edge detection. No assumptions about the object or background are necessary for this process. It detects blobs of interest in the scene and treats them as object candid...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996